Global convergence of rank-one PGD approximations by alternate minimization
نویسندگان
چکیده
منابع مشابه
Convergence of Discrete Approximations for Constrained Minimization
If a constrained minimization problem, under Lipschitz or uniformly continuous hypotheses on the functions, has a strict local minimum, then a small perturbation of the functions leads to a minimum of the perturbed problem, close to the unperturbed minimum. Conditions are given for the perturbed minimum point to be a Lipschitz function of a perturbation parameter. This is used to study converge...
متن کاملRank One Perturbations, Approximations, and Selfadjoint Extensions
of a semibounded selfadjoint operator A are studied with the help of distribution theory. It is shown that such perturbations can be defined for finite values of : even if the element . does not belong to H&1(A). Approximations of the rank one perturbations are constructed in the strong operator topology. It is proven that rank one H&2 perturbations can be defined uniquely for the homogeneous o...
متن کاملTractable and Scalable Schatten Quasi-Norm Approximations for Rank Minimization
The Schatten quasi-norm was introduced tobridge the gap between the trace norm andrank function. However, existing algorithmsare too slow or even impractical for large-scale problems. Motivated by the equivalencerelation between the trace norm and its bilin-ear spectral penalty, we define two tractableSchatten norms, i.e. the bi-trace and tri-tracenorms, and prov...
متن کاملConvergence of fixed point continuation algorithms for matrix rank minimization
The matrix rank minimization problem has applications in many fields such as system identification, optimal control, low-dimensional embedding, etc. As this problem is NP-hard in general, its convex relaxation, the nuclear norm minimization problem, is often solved instead. Recently, Ma, Goldfarb and Chen proposed a fixed-point continuation algorithm for solving the nuclear norm minimization pr...
متن کاملOn the Global Convergence of the High-order Power Method for Rank-one Tensor Approximation
Tensor decomposition has consequential applications in various fields of disciplines, but it remains to be an extremely challenging task even to this date. A slightly more manageable endeavor has been to find a low rank approximation in place of the decomposition. Even for this less stringent task, it is an established fact that tensors beyond matrices can fail to have best low rank approximati...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Differential Equations and Applications
سال: 2022
ISSN: ['1847-120X', '1848-9605']
DOI: https://doi.org/10.7153/dea-2022-14-32